class Solution {
public:
    int maxProfit(vector<int>& p, int fee) {
        int n=p.size();
        vector<vector<int>> dp(n,vector<int>(2,0));
        dp[0][0]=-p[0]-fee;
        for(int i=1;i<n;++i)
        {
            dp[i][0]=max(dp[i-1][1]-p[i]-fee,dp[i-1][0]);
            dp[i][1]=max(dp[i-1][1],dp[i-1][0]+p[i]);
        }
        return max(dp[n-1][0],dp[n-1][1]);
    }
};
